Generating Arithmetically Equivalent Number Fields with Elliptic Curves

نویسنده

  • Bart de Smit
چکیده

In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known to be no for p = 2. Using torsion points on elliptic curves we give for each odd prime p an explicit family of pairs of non-isomorphic number fields of degree 2p + 2 which have the same zeta-function and which satisfy a necessary condition for the fields to have distinct p-class numbers. By computing class numbers of fields in this family for p = 3 we find examples of fields with the same zeta-function whose class numbers differ by a factor 3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Refined Notion of Arithmetically Equivalent Number Fields, and Curves with Isomorphic Jacobians

We construct examples of number fields which are not isomorphic but for which their adele groups, the idele groups, and the idele class groups are isomorphic. We also construct examples of projective algebraic curves which are not isomorphic but for which their Jacobian varieties are isomorphic. Both are constructed using an example in group theory provided by Leonard Scott of a finite group G ...

متن کامل

Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography

We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Complex Multiplication. Furthermore, we demonstrate the efficiency of the algorithm in practice by giving practical running times. In addition, we present statistics on the number of cryptographically strong elliptic curves...

متن کامل

On Pseudo-Random Number Generators Using Elliptic Curves and Chaotic Systems

Elliptic Curve Cryptography (ECC) is a relatively recent branch of cryptography which is based on the arithmetic on elliptic curves and security of the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Elliptic curve cryptographic schemes are public-key mechanisms that provide encryption, digital signature and key exchange capabilities. Elliptic curve algorithms are also applie...

متن کامل

Elliptic Curves over Q and 2-adic Images of Galois

We give a classification of all possible 2-adic images of Galois representations associated to elliptic curves over Q. To this end, we compute the ‘arithmetically maximal’ tower of 2-power level modular curves, develop techniques to compute their equations, and classify the rational points on these curves.

متن کامل

Generating Elliptic Curves over Finite Fields Part I: Generating by Complex Multiplication

We study the theory of rational points on elliptic curves over nite elds and the theory of complex multiplication through which we construct elliptic curves over F p such that their orders of the group of rational points over F p are of the form mr where r is a prime and m is a small integer.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998